Butterfly Project Report 13 DARPA Parallel Architecture Benchmark Study

نویسندگان

  • P. Dibble
  • N. Gafter
  • B.March
  • T. Olson
  • L. Sanchis
  • Christopher Brown
  • Tom LeBlanc
  • Michael Scott
چکیده

In intensive work over a four-week period in the summer of 1986, seven problems were studied and implemented on the Butterfly. The problems were Inspired by various capabilities in computer vision, and were proposed as benchmarks for a DARPA worksho{' on parallel architectures. They were: convolution and zero-crossing detectlOn for edges, edge tracking, connected component labeling, hough transform, three computational geometry problems (convex hull, voronoi diagram, and minimum spanning tree), three-dimensional visibility calculations, subgraph isomorphism and minimum cost path calculation. BPRs 10,11, and 14 are detailed reports on three of the problems. BPR13 contains the conclusions of the study and writeups of the work not covered in other BPRs. This work was supported in part by the Defense Advanced Research Projects Agency U.S. Army Topographic Labs under grant number DACA76-85-C-0001 and in part by the National Science Foundation under grant number DCR-8320136.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Final Report: Combining Interprocedural Compile-Time and Run-Time Parallelization

This report describes the final results of a project revolving around an integrated automatic parallelization system that combines high quality interprocedural compile-time analysis with flexible run-time support. This research builds on our previous extensive work on interprocedural compiletime analysis for parallelization, sponsored by DARPA through contracts at Rice University and Stanford U...

متن کامل

Fast Parallel Sorting Algorithms on Gpus

This paper presents a comparative analysis of the three widely used parallel sorting algorithms: OddEven sort, Rank sort and Bitonic sort in terms of sorting rate, sorting time and speed-up on CPU and different GPU architectures. Alongside we have implemented novel parallel algorithm: min-max butterfly network, for finding minimum and maximum in large data sets. All algorithms have been impleme...

متن کامل

Forward Position Kinematics of a Parallel Manipulator with New Architecture

The forward position kinematics (FPK) of a parallel manipulator with new architecture supposed to be used as a moving mechanism in a flight simulator project is discussed in this paper. The closed form solution for the FPK problem of the manipulator is first determined. It has, then, been shown that there are at most 24 solutions for FPK problem. This result has been verified by using other tec...

متن کامل

Analysis of Textural Features in Medical Images Using Medium-cost Parallel Computers

A valuable tool in the quantification of textural information in images is the cooccurrence matrix due to Haralick [1, 2]. Cooccurrence matrices are used to compute second order statistical features, which are then used in the detection of patterns in image texture [3, 4]. The construction of cooccurrence matrices is dependent on the direction you move through the original image. Even when the ...

متن کامل

Architectural Support for Extensibility and Autonomy in Wide-Area Distributed Object Systems1

The Legion system defines a software architecture designed to support metacomputing, the use of large collections of heterogeneous computing resources distributed across localand wide-area networks as a single, seamless virtual machine. Metasystems software must be extensible because no single system can meet all of the diverse, often conflicting, requirements of the entire present and future u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1986